Branching-time logic ECTL# and its tree-style one-pass tableau: Extending fairness expressibility of ECTL+
نویسندگان
چکیده
منابع مشابه
Satisfiability of ECTL* with Tree Constraints
Recently, we have shown that satisfiability for ECTL∗ with constraints over Z is decidable using a new technique. This approach reduces the satisfiability problem of ECTL∗ with constraints over some structure A (or class of structures) to the problem whether A has a certain model theoretic property that we called EHD (for “existence of homomorphisms is decidable”). Here we apply this approach t...
متن کاملA Clausal Resolution Method for Extended Computation Tree Logic ECTL
A temporal clausal resolution method was originally developed for linear time temporal logic and further extended to the branching-time framework of Computation Tree Logic (CTL). In this paper, following our general idea to expand the applicability of this efficient method to more expressive formalisms useful in a variety of applications in computer science and AI requiring branching time logic...
متن کاملSatisfiability of ECTL⁎ with constraints
We show that satisfiability and finite satisfiability for ECTL with equality-, order-, and modulo-constraints over Z are decidable. Since ECTL is a proper extension of CTL this greatly improves the previously known decidability results for certain fragments of CTL, e.g., the existential and positive fragments and EF. We also show that our choice of local constraints is necessary for the result ...
متن کاملBTL2 and the expressive power of ECTL+
We show that ECTL+, the classical extension of CTL with fairness properties, is expressively equivalent to BTL2, a natural fragment of the monadic logic of order. BTL2 is the branching-time logic with arbitrary quantification over paths, and where path formulae are restricted to quantifier depth 2 first-order formulae in the monadic logic of order. This result, linking ECTL+ to a natural fragme...
متن کاملImproving the Translation from ECTL to SAT
The objective of this paper is to offer an improvement to the translation from ECTL to SAT introduced in [7] and show that the improvement proposed substantially increases the efficiency of verifying temporal properties using the Bounded Model Checking method. keywords: ECTL, Bounded Model Checking, translation to SAT
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2020
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2020.02.015